Division with speculation of quotient digits
نویسندگان
چکیده
The speed of SRT-type dividers is mainly determined by the complexity of the quotient-digit selection , so that implementations are limited to low-radix stages. We present a scheme in which the quotient-digit is speculated and, when this speculation is incorrect , a rollback or a partial advance is performed. This results in a division operation with a shorter cycle time and a variable number of cycles. We performed several designs and report results that show a radix-64 implementation that is 30% faster than the fastest conventional implementation (radix-8) at an increase of about 45% in area per quotient bit. Moreover , we show a radix-16 implementation that is about 10% faster than the radix-8 conventional one, with the additional advantage of requiring about 25% less area per quotient bit.
منابع مشابه
A Radix-16 SRT Division Unit with Speculation of the Quotient Digits
The speed of a divider based on a digit-recurrence algorithm depends mainly on the latency of the quotient digit generation function. In this paper we present an analytical approach that extends the theory developed for standard SRT division and permits to implement division schemes where a simpler function speculates the quotient digit. This leads to division units with shorter cycle time and ...
متن کاملDivision with Speculation of the Quotient Digits
Progress in VLSI technology has made possible the hardware implementation of all the basic arithmetic operations in the design of general-purpose as well as special-purpose processors. While operations such as multiplication and sum have been extensively studied and fast implementations are possible, the design of fast and eecient circuits for division is still challenging. The factor that limi...
متن کاملHigh-Radix Division with Approximate Quotient-Digit Estimation
High-radix division, developing several quotient bits per clock, is usually limited by the difficulty of generating accurate high-radix quotient digits. This paper describes techniques which allow quotient digits to be inaccurate, but then refine the result. We thereby obtain dividers with slightly reduced performance, but with much simplified logic. For example, a nominal radix-64 divider can ...
متن کاملComplex Division with Prescaling of Operands
We adapt the radix-r digit-recurrence division algorithm to complex division. By prescaling the operands, we make the selection of quotient digits simple. This leads to a simple hardware implementation, and allows correct rounding of complex quotient. To reduce large prescaling tables required for radices greater than 4, we adapt the bipartite-table method to multiple-operand functions.
متن کاملTight Upper Bounds on the Minimum Precision Required of the Divisor and the Partial Remainder in High-Radix Division
Digit-recurrence binary dividers are sped up via two complementary methods: keeping the partial remainder in redundant form and selecting the quotient digits in a radix higher than 2. Use of a redundant partial remainder replaces the standard addition in each cycle by a carry-free addition, thus making the cycles shorter. Deriving the quotient in high radix reduces the number of cycles (by a fa...
متن کامل